Symbolic orthogonal projections: a new polyhedral representation for reachability analysis of hybrid systems
نویسنده
چکیده
This thesis deals with reachability analysis of linear hybrid systems. Special importance is given to the treatment of the necessary geometrical operations. In the first part, we introduce a new representation class for convex polyhedra, the symbolic orthogonal projections (sops). A sop encodes a polyhedron as an orthogonal projection of a higher-dimensional polyhedron. This representation is treated purely symbolically, in the sense that the actual computation of the projection is avoided. We show that fundamental geometrical operations, like affine transformations, intersections, Minkowski sums, and convex hulls, can be performed by block matrix operations on the representation. Compared to traditional representations, like half-space representations, vertex representations, or representations by support functions, this is a unique feature of sops. Linear programming helps us to evaluate sops. In the second part, we investigate the application of sops in reachability analysis of hybrid systems. It turns out that sops are well-suited for the discrete computations. Thereupon, we demonstrate also the applicability of sops for the continuous computation of reachability analysis. By a subtle parallel computation of a precise sop-based representation and a simplified representation, we tackle the problem of monotonic growing sizes of the sops. Additionally, we present experimental results which also show that sops allow an efficient and accurate computation of the reachable states.
منابع مشابه
Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملSome Conditions for Characterizing Minimum Face in Non-Radial DEA Models with Undesirable Outputs
The problem of utilizing undesirable (bad) outputs in DEA models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. The Kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. Also, there are some specific features of non-radial data envelopment analysis (DEA...
متن کاملApproximate Computation of Reach Sets in Hybrid Systems
One of the most important problems in hybrid systems is the reachability problem. The reachability problem has been shown to be undecidable even for a subclass of linear hybrid systems. In view of this, the main focus in the area of hybrid systems has been to find effective semi-decision procedures for this problem. Such an algorithmic approach involves finding methods of computation and repres...
متن کاملReachability Analysis of Hybrid Systems with Linear Dynamics
We present results on symbolic reachability analysis for hybrid systems with linear autonomous dynamics in each location.
متن کاملConic Abstractions for Hybrid Systems
Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for t...
متن کامل